Matching in Description Logics with Existential Restrictions
نویسندگان
چکیده
Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the Classic system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. This paper extends the existing work on matching in two directions. On the one hand, the question of what are the most \interest-ing" solutions of matching problems is explored in more detail. On the other hand, for languages with existential restrictions both, the complexity of deciding the solvability of matching problems and the complexity of actually computing sets of \interesting" match-ers are determined. The results show that existential restrictions make these computational tasks more complex. Whereas for sub-languages of Classic both problems could be solved in polynomial time, this is no longer possible for languages with existential restrictions .
منابع مشابه
Matching Concept Descriptions with Existential Restrictions
Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the Classic system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. Motivated by an application in chemical process engineering, which requires a ...
متن کاملMatching Concept Descriptions with Existential Restrictions Matching Concept Descriptions with Existential Restrictions
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of description logics , originally to help lter out unimportant aspects of large concepts appearing in industrial-strength knowledge bases. Previous work has concentrated on (sub-)languages of CLASSIC, which in particular do not allow for existential restrictions. In this...
متن کاملComputing Least Common Subsumer in Description Logics with Existential Restrictions Computing Least Common Subsumer in Description Logics with Existential Restrictions
Computing the least common subsumer (lcs) is an inference task that can be used to support the \bottom-up" construction of knowledge bases for KR systems based on description logics. Previous work on how to compute the lcs has concentrated on description logics that allow for universal value restrictions, but not for existential restrictions. The main new contribution of this paper is the treat...
متن کاملRewriting Conjunctive Queries using Views in Description Logics with Existential Restrictions
متن کامل
Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles
Computing least common subsumers (Ics) and most specific concepts (msc) are inference tasks that can support the bottom-up construction of knowledge bases in description logics. In description logics with existential restrictions, the most specific concept need not exist if one restricts the attention to concept descriptions or acyclic TBoxes. In this paper, we extend the notions les and msc to...
متن کامل